50 research outputs found

    Filter-And-Forward Distributed Beamforming in Relay Networks with Frequency Selective Fading

    Full text link
    A new approach to distributed cooperative beamforming in relay networks with frequency selective fading is proposed. It is assumed that all the relay nodes are equipped with finite impulse response (FIR) filters and use a filter-and-forward (FF) strategy to compensate for the transmitter-to-relay and relay-to-destination channels. Three relevant half-duplex distributed beamforming problems are considered. The first problem amounts to minimizing the total relay transmitted power subject to the destination quality-of-service (QoS) constraint. In the second and third problems, the destination QoS is maximized subject to the total and individual relay transmitted power constraints, respectively. For the first and second problems, closed-form solutions are obtained, whereas the third problem is solved using convex optimization. The latter convex optimization technique can be also directly extended to the case when the individual and total power constraints should be jointly taken into account. Simulation results demonstrate that in the frequency selective fading case, the proposed FF approach provides substantial performance improvements as compared to the commonly used amplify-and-forward (AF) relay beamforming strategy.Comment: Submitted to IEEE Trans. on Signal Processing on 8 July 200

    Robust Linear Receivers for Space-Time Block Coded Multiple-Access MIMO Wireless Systems

    Get PDF

    Joint Power Allocation and Access Point Selection for Cell-free Massive MIMO

    Get PDF
    Cell-free massive multiple-input multiple-output (CF-MIMO) is a promising technological enabler for fifth generation (5G) networks in which a large number of access points (APs) jointly serve the users. Each AP applies conjugate beamforming to precode data, which is based only on the AP's local channel state information. However, by having the nature of a (very) large number of APs, the operation of CF-MIMO can be energy-inefficient. In this paper, we investigate the energy efficiency performance of CF-MIMO by considering a practical energy consumption model which includes both the signal transmit energy as well as the static energy consumed by hardware components. In particular, a joint power allocation and AP selection design is proposed to minimize the total energy consumption subject to given quality of service (QoS) constraints. In order to deal with the combinatorial complexity of the formulated problem, we employ norm l2,1l_{2,1}-based block-sparsity and successive convex optimization to leverage the AP selection process. Numerical results show significant energy savings obtained by the proposed design, compared to all-active APs scheme and the large-scale based AP selection

    One-Bit Quantized Constructive Interference Based Precoding for Massive Multiuser MIMO Downlink

    Get PDF
    We propose a one-bit symbol-level precoding method for massive multiuser multiple-input multiple-output (MU-MIMO) downlink systems using the idea of constructive interference (CI). In particular, we adopt a max-min fair design criterion which aims to maximize the minimum instantaneous received signal-to-noise ratio (SNR) among the user equipments (UEs), while ensuring a CI constraint for each UE and under the restriction that the output of the precoder is a vector of binary elements. This design problem is an NP-hard binary quadratic programming due to the one-bit constraints on the elements of the precoder’s output vector, and hence, is difficult to solve. In this paper, we tackle this difficulty by reformulating the problem, in several steps, into an equivalent continuous-domain biconvex form. Our final biconvex reformulation is obtained via an exact penalty approach and can efficiently be solved using a standard block coordinate ascent algorithm. We show through simulation results that the proposed design outperforms the existing schemes in terms of (uncoded) bit error rate. It is further shown via numerical analysis that our solution algorithm is computationally-efficient as it needs only a few tens of iterations to converge in most practical scenarios
    corecore